Information-Theoretic Lower Bounds for Distributed Function Computation
نویسندگان
چکیده
منابع مشابه
Information theoretic bounds for distributed computation
A network of nodes communicate via noisy channels. Each node has some real-valued initial measurement or message. The goal of each of the nodes is to acquire an estimate of a given function of all the initial measurements in the network. As the main contribution of this paper, we obtain a lower bound on computation time that must be satisfied by any algorithm used by the nodes to communicate an...
متن کاملInformation-theoretic lower bounds for distributed statistical estimation with communication constraints
We establish lower bounds on minimax risks for distributed statistical estimation under a communication budget. Such lower bounds reveal the minimum amount of communication required by any procedure to achieve the centralized minimax-optimal rates for statistical estimation. We study two classes of protocols: one in which machines send messages independently, and a second allowing for interacti...
متن کاملInformation-theoretic lower bounds for convex optimization with erroneous oracles
We consider the problem of optimizing convex and concave functions with access to an erroneous zeroth-order oracle. In particular, for a given function x → f(x) we consider optimization when one is given access to absolute error oracles that return values in [f(x) − , f(x) + ] or relative error oracles that return value in [(1− )f(x), (1 + )f(x)], for some > 0. We show stark information theoret...
متن کاملComplexity Lower Bounds for Computation Trees with ElementaryTranscendental Function
We consider computation trees which admit as gate functions along with the usual arithmetic operations also algebraic or transcendental functions like exp; log; sin; square root (deened in the relevant domains) or much more general, Pfaaan functions. A new method for proving lower bounds on the depth of these trees is developed which allows to prove a lower bound (p logN) for testing membership...
متن کاملInformation-theoretic lower bound on energy cost of stochastic computation
BY KAROLINE WIESNER1,*, MILE GU2, ELISABETH RIEPER2 AND VLATKO VEDRAL2,3,4 1School of Mathematics, Centre for Complexity Sciences, University of Bristol, University Walk, Bristol BS8 1TW, UK 2Centre for Quantum Technologies, National University of Singapore, 3 Science Drive 2, S15-03-18, Singapore 117543, Republic of Singapore 3Department of Physics, National University of Singapore, 2 Science ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2017
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2017.2664813